D-CAS: Distributed and Adaptive Channel Assignment Scheme for Clustered Wireless Sensor Networks

نویسندگان

  • Ashok Prajapati
  • Subra Ganesan
چکیده

This paper proposes a distributed and adaptive channel assignment (D-CAS) scheme for wireless sensor networks. D-CAS performs statistical analysis of load pattern of the individual cluster and adjusts channel assignment dynamically as per requirement generated by the current cluster’ traffic load. It follows a static schedule during infrastructure establishment based on initial traffic conditions and previous history. Later, it utilizes dynamic schedule for channel adjustments. Over a period of time, learning efficiency of the load prediction increases due to availability of more traffic patterns, which in turn, reduces transmission wait and increases the system throughput and network life significantly. It provides seamless data transmission even in peak hours and is highly immune to the random traffic change. This algorithm optimizes the channel utilization by best-of-four strategies and meets the real time requirement of sensor network applications. This algorithm is distributed at clusters level and central at node level i.e. it collectively possesses the advantages of all four: static, dynamic, central, and distributed channel assignment approaches. This paper ends with planned future work which includes simulation, performance analysis, and traffic prediction accuracy. Index Terms – Sensor Network, Channel Assignment, DCA, SCA, Hybrid, Distributed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and evaluation of two distributed methods for sensors placement in Wireless Sensor Networks

Adequate coverage is one of the main problems for distributed wireless sensor networks and The effectiveness of that highly depends on the sensor deployment scheme. Given a finite number of sensors, optimizing the sensor deployment will provide sufficient sensor coverage and save power of sensors for movement to target location to adequate coverage. In this paper, we apply fuzzy logic system to...

متن کامل

Design and evaluation of two distributed methods for sensors placement in Wireless Sensor Networks

Adequate coverage is one of the main problems for distributed wireless sensor networks and The effectiveness of that highly depends on the sensor deployment scheme. Given a finite number of sensors, optimizing the sensor deployment will provide sufficient sensor coverage and save power of sensors for movement to target location to adequate coverage. In this paper, we apply fuzzy logic system to...

متن کامل

Hybrid Key pre-distribution scheme for wireless sensor network based on combinatorial design

Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...

متن کامل

Tracking performance of incremental LMS algorithm over adaptive distributed sensor networks

in this paper we focus on the tracking performance of incremental adaptive LMS algorithm in an adaptive network. For this reason we consider the unknown weight vector to be a time varying sequence. First we analyze the performance of network in tracking a time varying weight vector and then we explain the estimation of Rayleigh fading channel through a random walk model. Closed form relations a...

متن کامل

Mathematical Analysis of Optimal Tracking Interval Management for Power Efficient Target Tracking Wireless Sensor Networks

In this paper, we study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects howev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010